Preconditioning Parametrized Linear Systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preconditioning Helmholtz linear systems

Linear systems which originate from the simulation of wave propagation phenomena can be very difficult to solve by iterative methods. These systems are typically complex valued and they tend to be highly indefinite, which renders the standard ILU-based preconditioners ineffective. This paper presents a study of ways to enhance standard preconditioners by altering the diagonal by imaginary shift...

متن کامل

Parametrized Linear

In the behavioral approach a dynamical system is essentially determined by a set of trajectories B, which is called behavior. There exist various ways for representing behaviors that are linear and shift-invariant: kernel representations, image representations and latent variable representations. In this paper we deal with families of parametrized linear shift-invariant behaviors and with the p...

متن کامل

Approximate Inverse Preconditioning for Shifted Linear Systems

In this paper we consider the problem of preconditioning symmetric positive definite matrices of the form Aα = A+αI where α > 0. We discuss how to cheaply modify an existing sparse approximate inverse preconditioner for A in order to obtain a preconditioner for Aα. Numerical experiments illustrating the performance of the proposed approaches are presented. AMS subject classification (2000): 65F...

متن کامل

Some Preconditioning Techniques for Linear Systems

New convergence intervals of parameters αi are derived and applied for solving the modified linear systems, which enables a better understanding of how parameters should be chosen. The convergence theorem for H-matrix is given. Meanwhile, we discuss the convergence results forM -matrices linear systems and give some new preconditioners. Numerical examples are used to illustrate our results. Key...

متن کامل

Combinatorial Preconditioning for Sparse Linear Systems

A key ingredient in the solution of a large, sparse system of linear equations by an iterative method like conjugate gradients is a preconditioner, which is in a sense an approximation to the matrix of coefficients. Ideally, the iterative method converges much faster on the preconditioned system at the extra cost of one solve against the preconditioner per iteration. We survey a little-known te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2021

ISSN: 1064-8275,1095-7197

DOI: 10.1137/20m1331123